Optimal two-level speed assignment for real-time systems
نویسندگان
چکیده
منابع مشابه
Optimal two-level speed assignment for real-time systems
Reducing energy consumption is one of the main concerns in the design and implementation of embedded real-time systems. For this reason, the current generation of processors allows to vary voltage and operating frequency to balance computational speed and energy consumption. This technique is called dynamic voltage scaling (DVS). When applying DVS to hard real-time systems, it is important to p...
متن کاملOptimal Two-Levels Speed Assignment for Real-Time Systems
Reducing energy consumption is one of the main concerns in the design and the implementation of embedded real-time systems. For this reason, the current generation of processors allows to vary voltage and operating frequency to balance computational speed versus energy consumption. This technique is called Dynamic Voltage Scaling (DVS). When applying DVS to hard real-time systems, it is importa...
متن کاملOptimal Priority Assignment Algorithms for Probabilistic Real-Time Systems
In this paper we investigate the problem of optimal priority assignment in fixed priority pre-emptive single processor systems where tasks have probabilistic execution times. We identify three sub-problems which optimise different metrics related to the probability of deadline failures. For each sub-problem we propose an algorithm that is proved optimal. The first two algorithms are inspired by...
متن کاملAdaptive Two-Level Scheduling for Soft Real-Time Systems
This paper presents an algorithm for scheduling jobs in soft real-time systems. To simplify the scheduling for soft real-time systems, we introduce a “two-level deadline” scheme. Each job in the system has two deadlines, which we call first-level and second-level deadlines, respectively. The first-level deadline is the same as the deadline in traditional real-time systems. The second-level dead...
متن کاملTwo-level Hierarchical Scheduling Algorithm for Real-time Multiprocessor Systems
The Earliest Deadline First (EDF) scheduling algorithm has the least runtime complexity among joblevel fixed-priority algorithms for scheduling tasks on multiprocessor architectures. However, EDF suffers from suboptimality in multiprocessor systems. This paper proposes a new restricted migration-based scheduling algorithm for multiprocessor real-time systems, called Two-level Hierarchical Sched...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Embedded Systems
سال: 2009
ISSN: 1741-1068,1741-1076
DOI: 10.1504/ijes.2009.027935